On the Non-Termination of Ruppert's Algorithm

نویسنده

  • Alexander Rand
چکیده

A planar straight-line graph which causes the non-termination Ruppert’s algorithm for a minimum angle threshold α ' 29.5 is given. The minimum input angle of this example is about 74.5 meaning that failure is not due to small input angles. Additionally, a similar non-acute input is given for which Chew’s second algorithm does not terminate for a minimum angle threshold α ' 30.7. For a non-acute planar straight-line graph, Ruppert’s algorithm produces a conforming Delaunay triangulation composed of triangles containing no angles less than α. Ruppert proved the algorithm terminates for all α / 20.7◦ [3] and a minor addition to the analysis extends the results to input with all angles larger than 60◦. In practice, the constraint α / 20.7◦ has been seen to be overly conservative. Ruppert observed that the minimum angle reaches 30◦ during typical runs of the algorithm. Further experimentation by Shewchuk [4] suggested that even higher values are admissible: “In practice, the algorithm generally halts with an angle constraint of 33.8◦, but often fails [at] 33.9◦.” In this note, we demonstrate an input (the upcoming Example 2) for which Ruppert’s algorithm does not terminate for some minimum angle parameter α less than 30◦. We begin by revisiting the best known example which causes non-termination for any α > 30◦. Pav Example Steven Pav gave an example demonstrating that Ruppert’s algorithm can fail to terminate for any α > 30◦ [2]. This example, depicted in Figure 1, involves two adjacent segments with lengths 1 and √ 2 such that they form a triangle with a 30◦ angle. Pav observed that the circumcenter of this triangle lies on the boundary of the diametral ball of the longer segment. This causes the longer segment to split, This note is an extension of “On the Termination of Ruppert’s Algorithm” which appeared in the Research Notes of the 19th International Roundtable, 2010. While generated after the submission deadline, these results were presented at the conference with the original research note. University of Texas-Austin, [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Examples of Non-Termination for Ruppert's Algorithm

Improving the best known examples, two planar straight-line graphs which cause the non-termination of Ruppert’s algorithm for a minimum angle threshold as low as α ' 29.06◦ are given.

متن کامل

Delaunay Refinement by Corner Lopping

An algorithm for quality Delaunay meshing of 2D domains with curved boundaries is presented. The algorithm uses Ruppert’s “corner lopping” heuristic [MR96b:65137]. In addition to admitting a simple termination proof, the algorithm can accept curved input without any bound on the tangent angle between adjoining curves. In the limit case, where all curves are straight line segments, the algorithm...

متن کامل

An Analysis of Shewchuk's Delaunay Refinement Algorithm

Shewchuk’s Delaunay refinement algorithm is a simple scheme to efficiently tetrahedralize a 3D domain. The original analysis provided guarantees on termination and output edge lengths. However, the guarantees are weak and the time and space complexity are not fully covered. In this paper, we present a new analysis of this algorithm. The new analysis reduces the original 90 requirement for the m...

متن کامل

Fully Generalized 2d Constrained Delaunay Mesh Refinement

Traditional refinement algorithms insert a Steiner point from a few possible choices at each step. Our algorithm, on the contrary, defines regions from where a Steiner point can be selected and thus inserts a Steiner point among an infinite number of choices. Our algorithm significantly extends existing generalized algorithms by increasing the number and the size of these regions. The lower bou...

متن کامل

توسعه روش SL با ترتیب KBO برای اثبات خودکار پایان‌پذیری سیستم بازنویسی ترم - مقاله برگزیده هفدهمین کنفرانس ملی انجمن کامپیوتر ایران

 The term rewriting systems (TRSs) is an abstract model of functional languages. The termination proving of TRSs is necessary for confirming accuracy of functional languages. The semantic labeling (SL) is a complete method for proving termination. The semantic part of SL is given by a quasi-model of the rewrite rules. The most power of SL is related to infinite models that is difficult f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1101.1071  شماره 

صفحات  -

تاریخ انتشار 2011